The 1‐2‐3‐Conjecture for Hypergraphs

A weighting of the edges of a hypergraph is called vertex‐coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e. every edge contains at least two vertices with different weighted degrees. In this article, we show that such a weighting is possible from the weight set for all hypergraphs with maximum edge size and not containing edges solely consisting of identical vertices. The number is best possible for this statement.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

Field-based hypotheses on advancing standards for mathematical practice

The Common Core State Standards in Mathematics (CCSSM, 2010) are organized around two types of standards: the standards for mathematical content and standards for mathematical practice. The central goal of this paper is to present cognitive and instructional analyses of standards for mathematical practice through a discussion of field-based activities with inservice secondary mathematics teachers and students. A potential value of the study is that it provides researchers with specific field-based hypotheses on advancing standards for mathematical practice.     

An adaptive wavelet space‐time SUPG method for hyperbolic conservation laws

This article concerns with incorporating wavelet bases into existing streamline upwind Petrov‐Galerkin (SUPG) methods for the numerical solution of nonlinear hyperbolic conservation laws which are known to develop shock solutions. Here, we utilize an SUPG formulation using continuous Galerkin in space and discontinuous Galerkin in time. The main motivation for such a combination is that these methods have good stability properties thanks to adding diffusion in the direction of streamlines. But they are more expensive than explicit semidiscrete methods as they have to use space‐time formulations. Using wavelet bases we maintain the stability properties of SUPG methods while we reduce the cost of these methods significantly through natural adaptivity of wavelet expansions. In addition, wavelet bases have a hierarchical structure. We use this property to numerically investigate the hierarchical addition of an artificial diffusion for further stabilization in spirit of spectral diffusion. Furthermore, we add the hierarchical diffusion only in the vicinity of discontinuities using the feature of wavelet bases in detection of location of discontinuities. Also, we again use the last feature of the wavelet bases to perform a postprocessing using a denosing technique based on a minimization formulation to reduce Gibbs oscillations near discontinuities while keeping other regions intact. Finally, we show the performance of the proposed combination through some numerical examples including Burgers’, transport, and wave equations as well as systems of shallow water equations.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2062–2089, 2017     

Exact and approximation product solutions form of heat equation with nonlocal boundary conditions using Ritz–Galerkin method with Bernoulli polynomials basis

In this article, a new method is introduced for finding the exact solution of the product form of parabolic equation with nonlocal boundary conditions. Approximation solution of the present problem is implemented by the Ritz–Galerkin method in Bernoulli polynomials basis. The properties of Bernoulli polynomials are first presented, then Ritz–Galerkin method in Bernoulli polynomials is used to reduce the given differential equation to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the techniques presented in this article for finding the exact and approximation solutions. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1143–1158, 2017     

Local and parallel finite element algorithm for stationary incompressible magnetohydrodynamics

This article presents a local and parallel finite element method for the stationary incompressible magnetohydrodynamics problem. The key idea of this algorithm comes from the two‐grid discretization technique. Specifically, we solve the nonlinear system on a global coarse mesh, and then solve a series of linear problems on several subdomains in parallel. Furthermore, local a priori estimates are obtained on a general shape regular grid. The efficiency of the algorithm is also illustrated by some numerical experiments.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1513–1539, 2017